On primitive words with non-primitive product

نویسندگان

چکیده

Let

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Morphisms Preserving Primitive Words

A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a primitive morphism but the converse does not hold. A precise characterization of primitive morphisms is provided in terms of pure codes. An easily testable characterization is given for uniform morphi...

متن کامل

Primitive partial words

Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in formal language theory, coding theory, and combinatorics on words to name a few. In this paper, we extend some fundamental results about primitive words to primitive partial words. Partial words are strings that may have a number of “do not know” symbols. © 2005 Else...

متن کامل

Abelian Primitive Words

We investigate Abelian primitive words, which are words that are not Abelian powers. We show the set of Abelian primitive words is not context-free. We can determine whether a word is Abelian primitive in linear time. Also different from classical primitive words, we find that a word may have more than one Abelian root. We also consider enumeration of Abelian primitive words.

متن کامل

Abelian-primitive partial words

In this paper we count the number of abelian-primitive partial words of a given length over a given alphabet size, which are partial words that are not abelian powers. Partial words are sequences that may have undefined positions called holes. This combinatorial problem was considered recently for full words (those without holes). It turns out that, even for the full word case, it is a nontrivi...

متن کامل

Counting Primitive Partial Words

A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain “do not know” symbols.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Informatics and Applications

سال: 2022

ISSN: ['0988-3754', '1290-385X']

DOI: https://doi.org/10.1051/ita/2022004